Quantum adiabatic algorithm for factorization and its experimental implementation.
نویسندگان
چکیده
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size.
منابع مشابه
Implementation of Single-Qutrit Quantum Gates via Tripod Adiabatic Passage
We proposed and analyzed implementation of the single-qutrit quantum gates based on stimulated Raman adiabatic passage (STIRAP) between magnetic sublevels in atoms coupled by pulsed laser fields. This technique requires only the control of the relative phase of the driving fields but do not involve any dynamical or geometrical phases, which make it independent of the other interaction details: ...
متن کاملGraph isomorphism and adiabatic quantum computing
In the Graph Isomorphism (GI) problem two N -vertex graphs G and G′ are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G → G′. If yes, then G and G′ are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficul...
متن کاملFourier-transforming with quantum annealers
*Correspondence: Itay Hen, Information Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA 90292, USA e-mail: [email protected] We introduce a set of quantum adiabatic evolutions that we argue may be used as “building blocks,” or subroutines, in the construction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT) with the same complexi...
متن کاملReducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 1: The "deduc-reduc" method and its application to quantum factorization of numbers
Adiabatic quantum computing has recently been used to factor 56153 [Dattani & Bryans, arXiv:1411.6758] at room temperature, which is orders of magnitude larger than any number attempted yet using Shor’s algorithm (circuit-based quantum computation). However, this number is still vastly smaller than RSA-768 which is the largest number factored thus far on a classical computer. We address a major...
متن کاملProbing nonlinear adiabatic paths with a universal integrator
We apply a flexible numerical integrator to the simulation of adiabatic quantum computation with nonlinear paths. We find that a nonlinear path may significantly improve the performance of adiabatic algorithms versus the conventional straight-line interpolations. The employed integrator is suitable for solving the time-dependent Schrödinger equation for any qubit Hamiltonian. Its flexible stora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 101 22 شماره
صفحات -
تاریخ انتشار 2008